Query Processing for Knowledge Bases Using Join
نویسنده
چکیده
This paper addresses the problem of physical query processing for large object-oriented, temporal knowledge bases. The major tasks being investigated are how to generate the space of all possible execution plans for a given knowledge base query and how to traverse this space in order to choose an eecient execution plan. The results of this work include: (a) the formulation of a set of access level operations which depend on the underlying storage model and the development of a cost model for estimating their cost; (b) the exploration of various optimization heuristics for selecting eecient execution plans for temporal path queries which make use of the join index relations that are provided by the storage model; and (c) a performance study that shows the beneets of join index based query processing techniques for knowledge bases compared to the traditional tuple-oriented (characteristic of the AI-DB coupling systems) and bulk join query processing approaches in database systems. 1 Introduction A critical factor to the success of knowledge base system technology, that deals with large-scale knowledge bases such as those referred in LG89], NFF
منابع مشابه
Relational Databases Query Optimization using Hybrid Evolutionary Algorithm
Optimizing the database queries is one of hard research problems. Exhaustive search techniques like dynamic programming is suitable for queries with a few relations, but by increasing the number of relations in query, much use of memory and processing is needed, and the use of these methods is not suitable, so we have to use random and evolutionary methods. The use of evolutionary methods, beca...
متن کاملAccelerating Rule-Based Reasoning in Disk-Resident RDF Knowledge Bases
Collections of tens of millions of automatically extracted facts represented using the subject-predicate-object RDF model are available for several domains. As big as these collections are, they are unable to capture all information about a domain, simply because the sources from which they were extracted are incomplete. This can be tackled by creating knowledge bases where facts are enforced w...
متن کاملAn Algorithm for Distributed Aggregation-join Query Processing in Data Grids
Aggregation-join query plays an important role in query processing in data girds and has been applied to many fields, such as global climate simulation, high energy physics and molecular biology. Applying aggregation and join operations on remote relations in data grids is a unique and difficult issue due to the heterogeneous, unpredictable and volatile behaviors of the grid resources. To the b...
متن کاملRDF-TX: A Fast, User-Friendly System for Querying the History of RDF Knowledge Bases
Knowledge bases that summarize web information in RDF triples deliver many benefits, including providing access to encyclopedic knowledge via SPARQL queries and end-user interfaces. As the real world evolves, the knowledge base is updated and the evolution history of entities and their properties becomes of great interest to users. Thus, users need query tools of comparable power and usability ...
متن کاملAn efficient XML encoding and labeling method for query processing and updating on dynamic XML data
In this paper, we propose an efficient encoding and labeling scheme for XML, called EXEL, which is a variant of the region labeling scheme using ordinal and insertfriendly bit strings. We devise a binary encoding method to generate the ordinal bit strings, and an algorithm to make a new bit string inserted between bit strings without any influences on the order of preexisting bit strings. These...
متن کامل